A Systematic Construction Method of Run Length Limited Codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction for obtaining trellis run length limited error control codes from convolutional codes

Recently a new construction of run length limited block error control codes based on control matrices of linear block codes was proposed. In this paper a similar construction for obtaining trellis run length limited error control codes from convolutional codes is described. The main advantage of it, beyond its simplicity is that it does not require any additional redundancy except the one which...

متن کامل

The power spectrum of run-length-limited codes

In this paper, a novel method is developed for computing formulae for the power spectra associated with run-length-limited (RLL) codes. Explicit use is made of a compact description of the run-length process associated with the RLL code. This association simplifies the general derivation of the power spectrum. The calculation of the spectra of several RLL codes popular in data storage applicati...

متن کامل

New Capacity-Approaching Codes for Run-Length-Limited Channels

To my parents ACKNOWLEDGEMENTS I have cherished the opportunity to work with Dr. Steven W. McLaughlin. His constant encouragement and enthusiasm have made us all feel comfortable. I am very grateful for his guidance, and wish him and his family the very best in coming years. V. Kuznetsov for several helpful discussions and insights. Other not-so-insightful, but nevertheless entertaining discuss...

متن کامل

Parallel Construction of the Minimum Redundancy Length-limited Codes

This paper presents new results on the construction of the length-limited preex-free codes with the minimum redundancy. We describe an algorithm for the construction of length-limited codes that works in O(L) time with n processors, where L is the maximal codeword length. We also describe an algorithm for the construction of almost optimal length-limited codes that works in O(log n) time with n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Magnetics Society of Japan

سال: 1998

ISSN: 1880-4004,0285-0192

DOI: 10.3379/jmsjmag.22.s3_39